Dakota- Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
نویسندگان
چکیده
منابع مشابه
Compressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملMMH: Software Message Authentication in the Gbit/Second Rates
We describe a construction of almost universal hash functions suitable for very fast software implementation and applicable to the hashing of variable size data and fast cryptographic message authenti-cation. Our construction uses fast single precision arithmetic which is increasingly supported by modern processors due to the growing needs for fast arithmetic posed by multimedia applications. W...
متن کاملFast Hashing and Rotation-Symmetric Functions
EÆcient hashing is a centerpiece of modern Cryptography. The progress in computing technology enables us to use 64-bit machines with the promise of 128bit machines in the near future. To exploit fully the technology for fast hashing, we need to be able to design cryptographically strong Boolean functions in many variables which can be evaluated faster using partial evaluations from the previous...
متن کاملModular Multiplication Algorithm in Cryptographic Processor: A Review and Future Directions
The strength of public-key cryptography depends on the degree of difficulty of a private key to be determined from its corresponding public key. Such a Key can be generated from computationally high radix arithmetic operations like modular exponentiation with very large integer values. To perform this modular exponentiation, different multiplication algorithms like Montgomery algorithm, Karatsu...
متن کامل